Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions

It is well-known that any admissible unidirectional heuristic search algorithm must expand all states whose $f$-value is smaller than the optimal solution cost when using a consistent heuristic. Such states are called "surely expanded" (s.e.). A recent study characterized s.e. pairs of states for bidirectional search with consistent heuristics: if a pair of states is s.e. then at least one of the two states must be expanded. This paper derives a lower bound, VC, on the minimum number of expansions required to cover all s.e. pairs, and present a new admissible front-to-end bidirectional heuristic search algorithm, Near-Optimal Bidirectional Search (NBS), that is guaranteed to do no more than 2VC expansions. We further prove that no admissible front-to-end algorithm has a worst case better than 2VC. Experimental results show that NBS competes with or outperforms existing bidirectional search algorithms, and often outperforms A* as well.Comment: Accepted to IJCAI 2017. Camera ready version with new timing result

Learning from the past with experiment databases

Thousands of Machine Learning research papers contain experimental comparisons that usually have been conducted with a single focus of interest, and detailed results are usually lost after publication. Once past experiments are collected in experiment databases they allow for additional and possibly much broader investigation. In this paper, we show how to use such a repository to answer various interesting research questions about learning algorithms and to verify a number of recent studies. Alongside performing elaborate comparisons and rankings of algorithms, we also investigate the effects of algorithm parameters and data properties, and study the learning curves and bias-variance profiles of algorithms to gain deeper insights into their behavior

The prediction of fatigue using speech as a biosignal

Automatic systems for estimating operator fatigue have application in safety-critical environments. We develop and evaluate a system to detect fatigue from speech recordings collected from speakers kept awake over a 60-hour period. A binary classification system (fatigued/not-fatigued) based on time spent awake showed good discrimination, with 80 % unweighted accuracy using raw features, and 90 % with speaker-normalized features. We describe the data collection, feature analysis, machine learning and cross-validation used in the study. Results are promising for real-world applications in domains such as aerospace, transportation and mining where operators are in regular verbal communication as part of their normal working activities

Assemblies of aziridinemethanols

Contains fulltext : 14060.pdf (publisher's version ) (Open Access

Empirical Evaluation of the Difficulty of Finding a Good Value of k for the Nearest Neighbor

As an analysis of the classification accuracy bound for the Nearest Neighbor technique, in this work we have studied if it is possible to find a good value of the parmeter k for each example according to their attribute values. Or at least, if there is a pattern for the parameter k in the original search space. We have carried out different approaches based onthe Nearest Neighbor technique and calculated the prediction accuracy for a group of databases from the UCI repository. Based on the experimental results of our study, we can state that, in general, it is not possible to know a priori a specific value of k to correctly classify an unseen example

Transthoracic echocardiography for imaging of the different coronary artery segments: a feasibility study

<p>Abstract</p> <p>Background</p> <p>Transthoracic echocardiography (TTE) may be used for direct inspection of various parts of the main coronary arteries for detection of coronary stenoses and occlusions. We aimed to assess the feasibility of TTE to visualise the complete segments of the left main (LM), left descending (LAD), circumflex (Cx) and right (RCA) coronary arteries.</p> <p>Methods</p> <p>One hundred and eleven patients scheduled for diagnostic coronary angiography because of chest pain or acute coronary syndrome had a TTE study to map the passage of the main coronary arteries. LAD, Cx and RCA were each divided into proximal, middle and distal segments. If any part of the individual segment of a coronary artery with antegrade blood flow was not visualised, the segment was labeled as not satisfactorily seen.</p> <p>Results</p> <p>Complete imaging of the LM was achieved in 98% of the patients. With antegrade directed coronary artery flow, the proximal, middle and distal segments of LAD were completely seen in 96%, 95% and 91% of patients, respectively. Adding the completely seen segments with antegrade coronary flow and segments with retrograde coronary flow, the proximal, middle and distal segments of LAD were adequately visualised in 96%, 96% and 93% of patients, respectively. With antegrade directed coronary artery flow, the proximal, middle and distal segments of Cx were completely seen in 88%, 61% and 3% and in RCA in 40%, 28% and 54% of patients. Retrograde coronary artery flow was correctly identified as verified by coronary angiography in seven coronary segments, mainly in the posterior descending artery (labeled as the distal segment of RCA) and distal LAD.</p> <p>Conclusions</p> <p>TTE is a feasible method for complete demonstration of coronary flow in the LM, the proximal Cx and the different segments of LAD, but less suitable for the RCA and mid and distal segments of the Cx. (ClinicalTrials.gov number NTC00281346.)</p

Stratus 11 : Eleventh Setting of the Stratus Ocean Reference Station Cruise on board RV Moana Wave, March 31 - April 16, 2011, Arica - Arica, Chile

The Ocean Reference Station at 20°S, 85°W under the stratus clouds west of northern Chile is being maintained to provide ongoing climate-quality records of surface meteorology, air-sea fluxes of heat, freshwater, and momentum, and of upper ocean temperature, salinity, and velocity variability. The Stratus Ocean Reference Station (ORS Stratus) is supported by the National Oceanic and Atmospheric Administration’s (NOAA) Climate Observation Program. It is recovered and redeployed annually, with past cruises that have come between October and January. A NOAA vessel was not available, so this cruise was conducted on the chartered ship, Moana Wave, belonging to Stabbert Maritime. During the 2011 cruise on the Moana Wave to the ORS Stratus site, the primary activities were the recovery of the subsurface part of the Stratus 10 WHOI surface mooring, deployment of a new (Stratus 11) WHOI surface mooring, in-situ calibration of the buoy meteorological sensors by comparison with instrumentation installed on the ship by staff of the NOAA Earth System Research Laboratory (ESRL), and collection of underway and on station oceanographic data to continue to characterize the upper ocean in the stratus region. The Stratus 10 mooring had parted, and the surface buoy and upper part had been recovered earlier. Underway CTD (UCTD) profiles were collected along the track and during surveys dedicated to investigating eddy variability in the region. Surface drifters and subsurface floats were also launched along the track. The intent was also to visit a buoy for the Pacific tsunami warning system maintained by the Hydrographic and Oceanographic Service of the Chilean Navy (SHOA). This DART (Deep- Ocean Assessment and Reporting of Tsunami) buoy had been deployed in December 2010.Funding was provided by the National Oceanic and Atmospheric Administration under Grant No. NA0900AR432012

Alternative splicing discriminates molecular subtypes and has prognostic impact in diffuse large B-cell lymphoma

Effect of alternative splicing (AS) on diffuse large B-cell lymphoma (DLBCL) pathogenesis and survival has not been systematically addressed. Here, we compared differentially expressed genes and exons in association with survival after chemoimmunotherapy, and between germinal center B-cell like (GCB) and activated B-cell like (ABC) DLBCLs. Genome-wide exon array-based screen was performed from samples of 38 clinically high-risk patients who were treated in a Nordic phase II study with dose-dense chemoimmunotherapy and central nervous system prophylaxis. The exon expression profile separated the patients according to molecular subgroups and survival better than the gene expression profile. Pathway analyses revealed enrichment of AS genes in inflammation and adhesion-related processes, and in signal transduction, such as phosphatidylinositol signaling system and adenosine triphosphate binding cassette transporters. Altogether, 49% of AS-related exons were protein coding, and domain prediction showed 28% of such exons to include a functional domain, such as transmembrane helix domain or phosphorylation sites. Validation in an independent cohort of 92 DLBCL samples subjected to RNA-sequencing confirmed differential exon usage of selected genes and association of AS with molecular subtypes and survival. The results indicate that AS events are able to discriminate GCB and ABC DLBCLs and have prognostic impact in DLBCL.Peer reviewe

A General Buffer Scheme for the Windows Scheduling Problem

Broadcasting is an efficient alternative to unicast for delivering popular on-demand media requests. Broadcasting schemes that are based on windows scheduling algorithms provide a way to satisfy all requests with both low bandwidth and low latency. Consider a system of n pages that need to be scheduled (transmitted) on identical channels an infinite number of times. Time is slotted, and it takes one time slot to transmit each page. In the windows scheduling problem (WS) each page i, 1 ≤ i ≤ n, is associated with a request window wi. In a feasible schedule for WS, page i must be scheduled at least once in any window of wi time slots. The objective function is to minimize the number of channels required to schedule all the pages. The main contribution of this paper is the design of a general buffer scheme for the windows scheduling problem such that any algorithm for WS follows this scheme. As a result, this scheme can serve as a tool to analyze and/or exhaust all possible WS-algorithms. The buffer scheme is based on modelling the system as a nondeterministic finite state machine in which any directed cycle corresponds to a legal schedule and vice-versa. Since WS is NP-hard, w